Separating subsets and stable values

Losing Treewidth by Separating Subsets

We study the problem of deleting the smallest set S of vertices (resp. edges) from a given graph G such that the induced subgraph (resp. subgraph) G \ S belongs to some class H. We consider the case where graphs in H have treewidth bounded by t, and give a general framework to obtain approximation algorithms for both vertex and edge-deletion settings from approximation algorithms for certain na...

Partitioning Subsets of Stable Models

This paper discusses two combinatorial problems in stability theory. First we prove a partition result for subsets of stable models: for any A and B, we can partition A into |B | ) pieces, 〈Ai | i < |B | 〉, such that for each Ai there is a Bi ⊆ B where |Bi| < κ(T ) and Ai |̂ Bi B. Second, if A and B are as above and |A | > |B |, then we try to find A′ ⊂ A and B′ ⊂ B such that |A′| is as large as...

StencilMaps and EphemeralMaps: spatially stable interfaces that highlight command subsets

StencilMaps and EphemeralMaps: spatially stable interfaces that highlight command subsets Joey Scarr, Carl Gutwin, Andy Cockburn & Andrea Bunt To cite this article: Joey Scarr, Carl Gutwin, Andy Cockburn & Andrea Bunt (2015) StencilMaps and EphemeralMaps: spatially stable interfaces that highlight command subsets, Behaviour & Information Technology, 34:11, 1092-1106, DOI: 10.1080/0144929X.2015....

Explaining instance classifications with interactions of subsets of feature values

In this paper, we present a novel method for explaining the decisions of an arbitrary classifier, independent of the type of classifier. The method works at the instance level, decomposing the model’s prediction for an instance into the contributions of the attributes’ values. We use several artificial data sets and several different types of models to show that the generated explanations refle...

A Representation for Characteristic Functionals of Stable Random Measures with Values in Sazonov Spaces